منابع مشابه
A Connectionist Treatment of Negation and Inconsistency
A connectionist model capable of encoding positive as well as negated knowledge and using such knowledge during rapid reasoning is described. The model explains how an agent can hold inconsistent beliefs in its long-term memory without being “aware” that its beliefs are inconsistent, but detect a contradiction whenever inconsistent beliefs that are within a certain inferential distance of each ...
متن کاملThe Attack as Strong Negation, Part I
We add strong negation N to classical logic and interpret the attack relation of “x attacks y” in argumentation as (x → Ny). We write a corresponding object level (using N only) classical theory for each argumentation network and show that the classical models of this theory correspond exactly to the complete extensions of the argumentation network. We show by example how this approach simplifi...
متن کاملOn Negation As Instantiation
Given a logic program P and a goal G, we introduce a notion which states when an SLD-tree for P fGg instantiates a set of variables V with respect to another one, W. We call this notion weak instantiation, as it is a generalisation of the instantiation property introduced by Di Pierro, Martelli and Palamidessi. A negation rule based on instanti-ation, the so-called Negation As Instantiation rul...
متن کاملNegation As Refutation
A refutation mechanism is introduced into logic programming, dual to the usual proof mechanism; then negation is treated via refutation. A four-valued logic is appropriate for the semantics: true, false, neither, both. Inconsistent programs are allowed, but inconsistencies remain localized. The four-valued logic is a well-known one, due to Belnap, and is the simplest example of Ginsberg’s bilat...
متن کاملNegation as Instantiation
We propose a new negation rule for logic programming which derives existentially closed negative literals, and we de ne a version of completion for which this rule is sound and complete. The rule is called \Negation As Instantiation" (NAI). According to it, a negated atom succeeds whenever all the branches of the SLD-tree for the atom either fail or instantiate the atom. The set of the atoms wh...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Logic Programming
سال: 1986
ISSN: 0743-1066
DOI: 10.1016/0743-1066(86)90002-6